Denesting by Bounded Degree Radicals
نویسنده
چکیده
Given a nested radical involving only d-th roots we show how to compute an optimal or near optimal depth denesting of this nested radical by a nested radical that involves only D-th roots, where D is an arbitrary multiple of d. As a special case the algorithm can be used to compute denestings as in previous papers by S. Landau and Horng/Huang. The running times of the algorithms are polynomial in the description size of the splitting eld for the original nested radical.
منابع مشابه
A Note on "Zippel Denesting"
Radical simpliication is an important part of symbolic computation systems. Zippel 7] gave a suucient condition for a nested radical to be expressed in terms of radicals of lower nesting depth. We ll a lacuna in his proof, and show that his suucient condition is also necessary. Previous work by Landau and Miller 4] leads to an algorithm for the problem.
متن کاملOn the denesting of nested square roots
We present the basic theory of denesting nested square roots, from an elementary point of view, suitable for lower-level coursework. Necessary and sufficient conditions are given for direct denesting, where the nested expression is rewritten as a sum of square roots of rational numbers, and for indirect denesting, where the nested expression is rewritten as a sum of fourth-order roots of ration...
متن کاملDecreasing the Nesting Depth of Expressions Involving Square Roots
We develop the theory for decreasing the depth of nesting in expressions that contain square roots We show exactly when fourth roots enable denesting of expresstons not denestable with square roots only When we restrict our attention to denesting over the real numbers, we show in fact that no roots other than square roots or fourth roots are ever useful for denesting expressions containing squa...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملThe Algebraic Complexity of Shortest Paths in Polyhedral Spaces
In this paper we show that the problem of finding the shortest path between two points in Euclidean 3-space, bounded by a finite collection of polyhedral obstacles, is in general not solvable by radicals over the field of rationals. The problem is shown to be not solvable even for the case when only two obstacle edges are encountered in the shof[est path in 3-space. One direct consequence of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997